Thompson Sampling-Based Channel Selection Through Density Estimation Aided by Stochastic Geometry
نویسندگان
چکیده
منابع مشابه
Thompson Sampling Based Mechanisms for Stochastic Multi-Armed Bandit Problems
This paper explores Thompson sampling in the context of mechanism design for stochastic multi-armed bandit (MAB) problems. The setting is that of an MAB problem where the reward distribution of each arm consists of a stochastic component as well as a strategic component. Many existing MAB mechanisms use upper confidence bound (UCB) based algorithms for learning the parameters of the reward dist...
متن کاملStochastic Regret Minimization via Thompson Sampling
The Thompson Sampling (TS) policy is a widely implemented algorithm for the stochastic multiarmed bandit (MAB) problem. Given a prior distribution over possible parameter settings of the underlying reward distributions of the arms, at each time instant, the policy plays an arm with probability equal to the probability that this arm has largest mean reward conditioned on the current posterior di...
متن کاملImpact of Sampling Theorem on Pilot Aided Channel Estimation for OFDM based Multi-Carrier System
Wireless multimedia has created boom in today’s era. It is just a fraction of seconds to get information at any time anywhere. All these because of the development of multicarrier communication system, OFDM, which provides high data rate as well as high speed. With that channel estimation becomes more challenging. In such multicarrier systems the time varying channel is often estimated based on...
متن کاملAnalysis of Thompson Sampling for Stochastic Sleeping Bandits
We study a variant of the stochastic multiarmed bandit problem where the set of available arms varies arbitrarily with time (also known as the sleeping bandit problem). We focus on the Thompson Sampling algorithm and consider a regret notion defined with respect to the best available arm. Our main result is anO(log T ) regret bound for Thompson Sampling, which generalizes a similar bound known ...
متن کاملThompson Sampling for Stochastic Bandits with Graph Feedback
We present a novel extension of Thompson Sampling for stochastic sequential decision problems with graph feedback, even when the graph structure itself is unknown and/or changing. We provide theoretical guarantees on the Bayesian regret of the algorithm, linking its performance to the underlying properties of the graph. Thompson Sampling has the advantage of being applicable without the need to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2966657